Predicate-Induced Permutation Groups
نویسنده
چکیده
Natural languages abound in combinatorial phenomena that are related to the predicate of the sentence and its ability to permute noun phrase arguments. After compiling several illustrative phenomena of natural languages, I propose a novel analysis in terms of permutation groups, a concept borrowed from mathematical combinatorics that is ubiquitous in applied sciences. I show that each natural language predicate of degree n (n natural number) can be associated with two permutation groups of degree n. The first group measures the predicate’s flexibility to permute arguments in two independent events, whereas the second group captures permutations in two dependent events. These groups serve as linguistic tools to help predict the predicate’s grammaticality pattern in a range of natural language constructions.
منابع مشابه
A note on the expressive power of linear orders
This article shows that there exist two particular linear orders such that firstorder logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a builtin permutation such that first-order logic with a linear order and this permutation is as expressive as FO(Bit).
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملOn minimal degrees of faithful quasi-permutation representations of nilpotent groups
By a quasi-permutation matrix, we mean a square non-singular matrix over the complex field with non-negative integral trace....
متن کاملTransitivity of finite permutation groups on unordered sets
From any given permutation group acting on a finite collection of n points one can form, for each positive integer k<=n, two permutation groups by considering respectively the permutations induced by the given group on the unordered sets of k distinct points and those induced on the ordered sets of k distinct points. We consider relations between these two groups. Our main object is to prove Th...
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Semantics
دوره 29 شماره
صفحات -
تاریخ انتشار 2012